Directional adaptive surface triangulation
نویسندگان
چکیده
Several CAD applications require a surface model of an object consisting of a mesh of triangular facets. In this paper, a new algorithm for triangulation of trimmed surfaces is presented. The algorithm generates a triangulation that approximates the initial surface within a predefined tolerance. The approximation is conformal, without cracks in edges: a closed polyhedron is obtained in the case of a closed initial surface. The proposed algorithm improves the algorithm presented in [3] because it is based on more precise bounds which take into account the directional behavior of local surface curvature, and the resulting triangulation has a lower number of triangles.
منابع مشابه
Effects of Directional Subdividing on adaptive Grid-Embedding (RESEARCH NOTE)
The effects of using both directions and directional subdividing on adaptive gridembedding on the computational time and the number of grid points required for the same accuracy are considered. Directional subdividing is used from the beginning of the adaptation procedure without any restriction. To avoid the complication of unstructured grid, the semi-structured grid was used. It is used to so...
متن کاملAdaptive and Smooth Surface Construction by Triangular A-Patches
We propose an approach to model a smooth surface from a surface triangulation by implicit surface patches which are subsets of zero contours of trivariate functions defined on a collection of irregular triangular prisms. Comparing with the earlier approaches of surface modeling by implicit surfaces, the proposed scheme uses much less patches, and can easily capture sharp features. Furthermore, ...
متن کاملHow to Shrinkwrap through a Critical Point: an Algorithm for the Adaptive Triangulation of Iso-Surfaces with Arbitrary Topology
An algorithm is presented which generates a triangular mesh to approximate an iso-surface. It starts with a triangulation of a sphere and next applies a series of adjustments to this triangulation to transform it into the required surface. It is based on the shrinkwrap method ([Overveld 93]), but unlike the original shrinkwrap algorithm, it allows for arbitrary topological genus of the resultin...
متن کاملRepresentation of a digitized surface by triangular faces
This paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. The method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. The method allows the measurement of the local quality ...
متن کاملNear-Optimal Adaptive Polygonization
Consider a triangulation of the xy plane, and a general surface z = f(x; y). The points of the triangle, when lifted to the surface, form a linear spline approximation to the surface. We are interested in the error between the surface and the linear approximant. In fact, we are interested in building triangulations in the plane such that the induced linear approximant is near-optimal with respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Aided Geometric Design
دوره 16 شماره
صفحات -
تاریخ انتشار 1999